On Graph Isomorphism for Restricted Graph Classes
نویسنده
چکیده
Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn’t be solved by classifying it as being either NP-complete or solvable in P. Nevertheless, efficient (polynomial-time or even NC) algorithms for restricted versions of GI have been found over the last four decades. Depending on the graph class, the design and analysis of algorithms for GI use tools from various fields, such as combinatorics, algebra and logic. In this paper, we collect several complexity results on graph isomorphism testing and related algorithmic problems for restricted graph classes from the literature. Further, we provide some new complexity bounds (as well as easier proofs of some known results) and highlight some open ques-
منابع مشابه
The sum-annihilating essential ideal graph of a commutative ring
Let $R$ be a commutative ring with identity. An ideal $I$ of a ring $R$is called an annihilating ideal if there exists $rin Rsetminus {0}$ such that $Ir=(0)$ and an ideal $I$ of$R$ is called an essential ideal if $I$ has non-zero intersectionwith every other non-zero ideal of $R$. Thesum-annihilating essential ideal graph of $R$, denoted by $mathcal{AE}_R$, isa graph whose vertex set is the set...
متن کاملImproved Lower Bounds for Graph Embedding Problems
In this paper, we give new, tight subexponential lower bounds for a number of graph embedding problems. We introduce two related combinatorial problems, which we call String Crafting and Orthogonal Vector Crafting, and show that these cannot be solved in time 2o(|s|/ log |s|), unless the Exponential Time Hypothesis fails. These results are used to obtain simplified hardness results for several ...
متن کاملOn the Regular Power Graph on the Conjugacy Classes of Finite Groups
emph{The (undirected) power graph on the conjugacy classes} $mathcal{P_C}(G)$ of a group $G$ is a simple graph in which the vertices are the conjugacy classes of $G$ and two distinct vertices $C$ and $C'$ are adjacent in $mathcal{P_C}(G)$ if one is a subset of a power of the other. In this paper, we describe groups whose associated graphs are $k$-regular for $k=5,6$.
متن کاملFuzzy Number-Valued Fuzzy Graph
Graph theory has an important role in the area of applications of networks and clustering. In the case of dealing with uncertain data, we must utilize ambiguous data such as fuzzy value, fuzzy interval value or values of fuzzy number. In this study, values of fuzzy number were used. Initially, we utilized the fuzzy number value fuzzy relation and then proposed fuzzy number-value f...
متن کاملON NEW CLASSES OF MULTICONE GRAPHS DETERMINED BY THEIR SPECTRUMS
A multicone graph is defined to be join of a clique and a regular graph. A graph $ G $ is cospectral with graph $ H $ if their adjacency matrices have the same eigenvalues. A graph $ G $ is said to be determined by its spectrum or DS for short, if for any graph $ H $ with $ Spec(G)=Spec(H)$, we conclude that $ G $ is isomorphic to $ H $. In this paper, we present new classes of multicone graphs...
متن کامل